Papers with similarity score function
Split or Merge: Which is Better for Unsupervised RST Parsing? (D19-1)
Copied to clipboard
| Challenge: | Rhetorical Structure Theory (RST) parsers have been based on supervised learning approaches that require an annotated corpus of sufficient size and quality. |
| Approach: | They propose two unsupervised methods that build an optimal RST tree based on a dissimilarity score function for splitting a text span into smaller ones and a similarity score for merging two adjacent spans into a large one. |
| Outcome: | The proposed method achieves the best score on English and German RST treebanks, around 0.8 F1 score, close to the previous supervised parsers. |